Evaluation of Natural Robustness of Best Constant Weights to Random Communication Breakdowns

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization of network robustness to random breakdowns

We study network configurations that provide optimal robustness to random breakdowns for networks with a given number of nodes N and a given cost—which we take as the average number of connections per node hki. We find that the network design that maximizes f c, the fraction of nodes that are randomly removed before global connectivity is lost, consists of q 1⁄4 1⁄2ðhki 1Þ= ffiffi h p ki ffiffi...

متن کامل

Constant compression and random weights

We introduce a new characterization of left-r.e. Martin-Löf random reals: a real is Martin-Löf random and recursively approximable from below if and only if it equals the weight of the compressible strings for some universal prefix-free machine. For sufficiently large intervals [a, b), the weight of strings which are a-compressible strings but not b-compressible is a left-r.e. Martin-Löf random...

متن کامل

examining the relationship between fear of negative evaluation and communication strategies by iranian efl learners

the purpose of the present study was to investigate the relationship between fear of negative evaluation (fne) and communication strategies (css) among iranian efl learners. it was aimed to examine the differences in the use of communication strategies between speakers with high or low degree of fear of negative evaluation. the current study was a case study consisting of 10 english learners at...

Resilience of the internet to random breakdowns

A common property of many large networks, including the Internet, is that the connectivity of the various nodes follows a scale-free power-law distribution, P(k) = ck(-alpha). We study the stability of such networks with respect to crashes, such as random removal of sites. Our approach, based on percolation theory, leads to a general condition for the critical fraction of nodes, p(c), that need...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Communications Software and Systems

سال: 2018

ISSN: 1845-6421

DOI: 10.24138/jcomss.v14i3.487